/*
 * This file belongs to the Galois project, a C++ library for exploiting parallelism.
 * The code is being released under the terms of the 3-Clause BSD License (a
 * copy is located in LICENSE.txt at the top-level directory).
 *
 * Copyright (C) 2018, The University of Texas at Austin. All rights reserved.
 * UNIVERSITY EXPRESSLY DISCLAIMS ANY AND ALL WARRANTIES CONCERNING THIS
 * SOFTWARE AND DOCUMENTATION, INCLUDING ANY WARRANTIES OF MERCHANTABILITY,
 * FITNESS FOR ANY PARTICULAR PURPOSE, NON-INFRINGEMENT AND WARRANTIES OF
 * PERFORMANCE, AND ANY WARRANTY THAT MIGHT OTHERWISE ARISE FROM COURSE OF
 * DEALING OR USAGE OF TRADE.  NO WARRANTY IS EITHER EXPRESS OR IMPLIED WITH
 * RESPECT TO THE USE OF THE SOFTWARE OR DOCUMENTATION. Under no circumstances
 * shall University be liable for incidental, special, indirect, direct or
 * consequential damages or loss of profits, interruption of business, or
 * related expenses which may arise from use of Software or Documentation,
 * including but not limited to those resulting from defects in Software and/or
 * Documentation, or loss or inaccuracy of data of any kind.
 */

#ifndef GALOISWORKER_H
#define GALOISWORKER_H

#include "galois/Galois.h"
#include "galois/Graph/LC_Morph_Graph.h"

#include <functional>
#include "TaskDescription.h"

#include "galois/Timer.h"
#include "galois/runtime/ll/SimpleLock.h"
#include "Node.h"

#ifdef WITH_PAPI
#include "papi.h"
#endif

typedef galois::worklists::PerSocketChunkLIFO<1> WL;

struct ProductionProcess {
public:
  ProductionProcess(){};

  template <typename Context>
  void operator()(Graph::GraphNode src, Context& ctx);
  std::vector<double>* operator()(TaskDescription& td);

private:
  Graph* graph;
  // returns effective size of memory allocated for matrices and RHS.
  unsigned long getAllocatedSize(Vertex* root);
  int atomic_dec(int* value);
  // galois::runtime::PerSocketStorage<WL> pps;
  int leftRange(int tasks, int cpus, int i);
  int rightRange(int tasks, int cpus, int i);
};

#endif
